Thinking and Researching Relationally

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Urban geographies I: Still thinking cities relationally

This review essay revisits recent scholarship within urban geography that has been shaped by relational theory, looking specifically at the scholarship on urban policy mobilities and urban assemblages. As will be shown, current urban geographies of relationality operate with irreconcilable grammars.

متن کامل

Researching Globalization: Re-thinking the Future of Collaborative Research

In the late 1980s the National Science Foundation advanced a proposal to integrate researchers working in different disciplines around the United States in virtual laboratories. Inspired by the potential for physical networks like the Internet to support and foster collaboration, the emergence of these "collaboratories" was celebrated as heralding a new epoch in scientific collaboration, which ...

متن کامل

Ontology Engineering Relationally

The retrieval problem is one of the main reasoning problems for ontology based systems. The retrieval problem for concept C consists in finding all individuals a which satisfy C(a). We present ontology transformation which can help to improve evaluating queries over (sublanguage of) OWL ontologies. Our solution is based on translating retrieval concepts into relational algebra expressions and c...

متن کامل

Re-thinking the ‘thing’: Sociomaterial approaches to understanding and researching learning in work

Purpose: This article compares theoretical conceptions that reclaim and re-think material practice – ‘the thing’ in the social and personal mix – specifically in terms of work activity and what is construed to be learning in that activity. Approach: The article is theory-based. Three perspectives have been selected for discussion: cultural-historical activity theory (CHAT), actor-network theory...

متن کامل

Relationally Periodic Sequences and Subword Complexity

By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of length n is constant. In this paper we consider relational periods and relationally periodic sequences, where the relation is a similarity relation on words induced by a compatibility relation on letters. We investig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Qualitative Methods

سال: 2018

ISSN: 1609-4069,1609-4069

DOI: 10.1177/1609406918776075